Factorial transformation for some classical combinatorial sequences
نویسندگان
چکیده
منابع مشابه
Logarithmic behavior of some combinatorial sequences
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic behavior of some combinatorially relevant sequences, such as Motzkin and Schröder numbers, sequences of values of some classic orthogonal polynomials, and ma...
متن کاملOn Monotonicity of Some Combinatorial Sequences
Recently the second author [3] posed many conjectures on monotonicity of sequences of the type ( n+1 √ an+1/ n √ an)n>N with (an)n>1 a familiar combinatorial sequence of positive integers. Throughout this paper, we set N = {0, 1, 2, . . .} and Z = {1, 2, 3, . . .}. Let A and B be integers with ∆ = A − 4B 6= 0. The Lucas sequence un = un(A,B) (n ∈ N) is defined as follows: u0 = 0, u1 = 1, and un...
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملA Combinatorial Survey of Identities for the Double Factorial
We survey combinatorial interpretations of some dozen identities for the double factorial such as, for instance, (2n− 2)!! + ∑n k=2 (2n−1)!!(2k−4)!! (2k−1)!! = (2n − 1)!!.
متن کاملtransformation semigroups and exact sequences
this text carries out some ideas about exact and p− exact sequences of transformationsemigroups. some theorems like the short five lemma (lemma 1.3 and lemma 2.3) are valid here as inexact sequences of r − modules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Keldysh Institute Preprints
سال: 2017
ISSN: 2071-2898,2071-2901
DOI: 10.20948/prepr-2017-114-e